An Efficient Implementation of Reactive Event Calculus
نویسندگان
چکیده
In this work, we propose a reactive version of the Event Calculus (EC) implemented on top of the SCIFF framework. Being reactive, such an implementation is able to dynamically update the status of fluents as events occur. Therefore, it can be employed to perform run-time reasoning and monitoring.
منابع مشابه
Reactive Reasoning with the Event Calculus
Systems for symbolic event recognition accept as input a stream of time-stamped events from sensors and other computational devices, and seek to identify high-level composite events, collections of events that satisfy some pattern. RTEC is an Event Calculus dialect with novel implementation and ‘windowing’ techniques that allow for efficient event recognition, scalable to large data streams. RT...
متن کاملEfficient Handling of Context Dependency in the Cached Event Calculus
This paper deals with the problem of providing temporal deductive databases with an eecient implementation in a logic programming framework. We restrict our attention to historical databases based on Kowalski and Sergot's Event Calculus extended with context-dependency. The paper aims at being beneecial to both the theoretically-minded and the implementation-oriented research communities. It pr...
متن کاملA Logic-Based, Reactive Calculus of Events
Since its introduction, the Event Calculus (EC) has been recognized for being an excellent framework to reason about time and events, and it has been applied to a variety of domains. However, its use inside logic-based frameworks has been mainly a-posteriori, based on specific queries and backward reasoning. This has somehow limited its applicability in dynamic environments. We fill this gap by...
متن کاملEfficient Temporal Reasoning in the Cached Event Calculus
This article deals with the problem of providing Kowalski and Sergot’s event calculus. extended with context dependency, with an efficient implementation in a logic programming framework. Despite a widespread recognition that a positive solution to efficiency issues is necessary to guarantee the computational feasibility of existing approaches to temporal reasoning, the problem of analyzing the...
متن کاملCommitment Tracking via the Reactive Event Calculus
Runtime commitment verification is an important, open issue in multiagent research. To address it, we build on Yolum and Singh’s formalization of commitment operations, on Chittaro and Montanari’s cached event calculus, and on the SCIFF abductive logic programming proof-procedure. We propose a framework consisting of a declarative and compact language to express the domain knowledge, and a reac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008